Test derivation based on tree FSMs and tree automata

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multidimensional fuzzy finite tree automata

This paper introduces the notion of multidimensional fuzzy finite tree automata (MFFTA) and investigates its closure properties from the area of automata and language theory. MFFTA are a superclass of fuzzy tree automata whose behavior is generalized to adapt to multidimensional fuzzy sets. An MFFTA recognizes a multidimensional fuzzy tree language which is a regular tree language so that for e...

متن کامل

A Derivation A = > Derivation Tree Derivation A = > Derivation Tree

The basic Schema Theorem for genetic algorithms is modiied for a grammatically-based learning system. A context-free grammar is used to deene a language in which each sentence is mapped to a tness value. The derivation trees associated with these sentences are used to deene the structure of schemata. The eeect of crossover and mutation on schemata is described. A schema theorem is developed whi...

متن کامل

NEW DIRECTION IN FUZZY TREE AUTOMATA

In this paper, our focus of attention is the proper propagationof fuzzy degrees in determinization of $Nondeterministic$ $Fuzzy$$Finite$ $Tree$ $Automata$ (NFFTA). Initially, two determinizationmethods are introduced which have some limitations (one inbehavior preserving and other in type of fuzzy operations). Inorder to eliminate these limitations and increasing theefficiency of FFTA, we defin...

متن کامل

TREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS

In this paper, at first we define the concepts of response function and accessible states of a complete residuated lattice-valued (for simplicity we write $mathcal{L}$-valued) tree automaton with a threshold $c.$ Then, related to these concepts, we prove some lemmas and theorems that are applied in considering some decision problems such as finiteness-value and emptiness-value of recognizable t...

متن کامل

Derivation Tree Based Genetic Programming

Acknowledgments Writing a thesis is a challenging journey and it begins long before the first word is written. Fortunately, I was lucky enough to have had great help during this endeavor. First of all, I would like to express my gratitude to my supervisor, apl. Prof. Dr.-Ing. Gabriella Kókai, who introduced me to the field of evolutionary computation. Without her support and guidance this thesi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the Institute for System Programming of RAS

سال: 2014

ISSN: 2079-8156,2220-6426

DOI: 10.15514/ispras-2014-26(6)-6